Ergodic Convergence to a Zero of the Extended Sum

In this note we show that the splitting scheme of Passty [7] as well as the barycentric-proximal method of Lehdili & Lemaire [4] can be used to approximate a zero of the extended sum of maximal monotone operators. When the extended sum is maximal monotone, we extend the convergence result obtained by Lehdili & Lemaire for convex functions to the case of maximal monotone operators. Moreover, we recover the main convergence results by Passty and Lehdili & Lemaire when the pointwise sum of the involved operators is maximal monotone

Algorithmes numeriques associes a des operateurs maximaux monotones, analyse quantitative et stabilite

SIGLEAvailable from INIST (FR), Document Supply Service, under shelf-number : T 79221 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

A note on Quasi Split Null-point Feasibility Problems

International audienc

From Implicit Convex Feasibility to Convex Minimization

International audienceno abstrac

Critical point concepts: a fixed-point approach

International audienc

Critical point concepts: a fixed-point approach

Inspired by the notion of critical points for DC functions and given two mappings P and Q, we introduce the concept of critical points in the fixed-point context and design and algorithm for finding such points. Connections are then made with the DC optimization case. We show that the proposed Algorithmic approach coincides with the celebrate DCA introduced by Pham Dinh Tao. The case of maximal monotone operators is also stated and investigated via a characterization of their associated resolvents

About Proximal Algorithms for Q-Lasso

International audienc

Difference of Two Norms-Regularizations for Q-Lasso

International audienc

A Reflected Inertial Krasnoselskii-Type Algorithm for Lipschitz Pseudo-contractive Ma pings

International audienc